Asymptotic bounds on the equilateral dimension of hypercubes
نویسندگان
چکیده
A subset of the finite dimensional hypercube is said to be equilateral if the distance of any two distinct points equals a fixed value. The equilateral dimension of the hypercube is defined as the maximal size of its equilateral subsets. We study asymptotic bounds on the latter quantity considered as a function of two variables, namely dimension and distance. lorenz minder, thomas sauerwald and sven-ake wegner
منابع مشابه
Asymmetrical Ramsey Bounds for Hypercubes
An n-cube is the set of 2 points in n-dimensional Euclidean space and is often denoted by {0, 1}n. It is known that n-cube as a Cartesian product of pair of points is Ramsey, but no asymmetrical results are known. In this work we are concerned with bounds on the necessary dimension n of Euclidean space such that every r-coloring gives us monochromatic hypercube of some color and given dimension...
متن کاملUpper bounds for noetherian dimension of all injective modules with Krull dimension
In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings. In particular, we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.
متن کاملEffect of dimensionality on the continuum percolation of overlapping hyperspheres and hypercubes.
We show analytically that the [0, 1], [1, 1], and [2, 1] Padé approximants of the mean cluster number S for both overlapping hyperspheres and overlapping oriented hypercubes are upper bounds on this quantity in any Euclidean dimension d. These results lead to lower bounds on the percolation threshold density η(c), which become progressively tighter as d increases and exact asymptotically as d →...
متن کاملOptimal pebbling in products of graphs
We prove a generalization of Graham’s Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal t-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5. Finally, we present explicit distributions which provide a...
متن کاملLazy Cops and Robbers on Hypercubes
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By coupling th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015